Regular character-graphs whose eigenvalues are greater than or equal to −2
نویسندگان
چکیده
Let G be a finite group and Irr ( ) the set of all complex irreducible characters . The character-graph Δ associated to , is graph whose vertex primes which divide degrees some in two distinct p q are adjacent if product pq divides χ 1 for ∈ Tong-Viet posed conjecture that k -regular integer ⩾ 2 then either complete or cocktail party graph. In this paper, we show his true regular character-graphs eigenvalues interval [ − ∞
منابع مشابه
Nonsingular mixed graphs with few eigenvalues greater than two
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mixed graphs G with exactly one Laplacian eigenvalue greater than 2 are also characterized. c © 2006 Elsevier Ltd. All rights reserved.
متن کاملAbelian p - groups of rank greater than or equal to 4 p − 2 are not CI - groups
In this paper we prove that an elementary Abelian p-group of rank 4p− 2 is not a CI(2)-group, i.e. there exists a 2-closed transitive permutation group containing two non-conjugate regular elementary Abelian p-subgroups of rank 4p − 2, see Hirasaka and Muzychuk (J. Comb. Theory Ser. A 94(2), 339–362, 2001). It was shown in Hirasaka and Muzychuk (loc cit) and Muzychuk (Discrete Math. 264(1–3), 1...
متن کاملSome Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
متن کاملRegular Factors of Regular Graphs from Eigenvalues
Let r and m be two integers such that r > m. Let H be a graph with order |H|, size e and maximum degree r such that 2e > |H|r−m. We find a best lower bound on spectral radius of graph H in terms of m and r. Let G be a connected r-regular graph of order |G| and k < r be an integer. Using the previous results, we find some best upper bounds (in terms of r and k) on the third largest eigenvalue th...
متن کاملThe Matching Equivalence Graphs with the Maximum Matching Root Less than or Equal to 2
In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113137